New Efficient Method to Generate Optimal 2-PSK STTCs with a Large Number of Transmit Antennas

نویسندگان

  • Pierre Viland
  • Gheorghe Zaharia
  • Jean-François Hélard
چکیده

In this paper, we propose a new method called coset partitioning to generate easily and efficiently the best space-time trellis codes (STTCs), thereby reducing considerably the usual important search time. This method, used in the case of 2-PSK STTCs, is an extension of the set partitioning proposed by Ungerboeck based on the coset and lattice Calderbank’s approach. The main guideline of the coset partitioning is to divide the set of MIMO symbols into cosets, not into simple sets as the set partitioning. The case of a large number of transmit antennas is considered because the time to obtain the best STTCs with an exhaustive search is very important when the number of transmit antennas increases. Using the coset partitioning, new 4-PSK STTCs with 5 to 6 transmit antennas are generated. Simulation results show that the new codes slightly outperform the best corresponding known codes. Thanks to the effectiveness of the coset partitioning, for the first time, 4-PSK STTCs with 7 and 8 transmit antennas and 8-PSK STTCs with 5 to 6 transmit antennas are obtained. Their performance is also analyzed by simulation. 1 ha l-0 06 17 99 0, v er si on 1 31 A ug 2 01 1 Author manuscript, published in "IET Communications 5, 10 (2011) 1413 1420" DOI : 10.1049/iet-com.2010.0252

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Generation of Space-Time Trellis Codes via Coset Partitioning

Criteria to design good space-time trellis codes (STTCs) have been already developed in previous publications. However, the computation of the best STTCs is time-consuming because a long exhaustive or systematic computing search is required, especially for a high number of states and/or transmit antennas. In order to reduce the search time, an efficient method must be employed to generate the S...

متن کامل

Improved Balanced 2-PSK STTCs for Several Transmit Antennas from a New and General Design Method

Recently, it has been established that the best spacetime trellis codes (STTCs) belong to a specific class of codes. These codes are called “balanced STTCs” because they use the points of the MIMO constellation with the same probability. Therefore, the search of the best codes can be reduced to this class. This paper presents a new and general method to design 2PSK balanced STTCs for any number...

متن کامل

QPSK Balanced Space Time Trellis Codes

All the best known space-time trellis codes (STTCs) belong to the Balanced STTCs class. The first method to design balanced STTCs is proposed in this letter. The exhaustive code search of optimal codes can then be reduced to this class. Finally, the proposed method is used to construct new QPSK codes for 3 and 4 transmit antennas which outperform the best previously published codes of the same ...

متن کامل

A general construction of space-time trellis codes for PSK signal sets

The diversity order and coding gain are crucial for the performance of a multiple antenna communication system. It is known that Space-Time Trellis Codes (STTC) can be used to achieve the above objectives. In particular we can use STTCs to obtain large coding gains. Many attempts have been made to construct STTCs which achieve full-diversity and good coding gains, though a general method of con...

متن کامل

[hal-00617995, v1] QPSK super-orthogonal space-time trellis codes with 3 and 4 transmit antennas

In this paper, we propose, for the first time, QPSK super-orthogonal space-time trellis codes (SO-STTCs) with 3 and 4 transmit antennas and with more than 4 states. In order to decrease drastically the search time of the best SO-STTCs with 3 and 4 transmit antennas, a matrix representation of codes and an adaptation of the coset partitioning are proposed. Thus, we obtain good SO-STTCs with more...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011